Polynomiality properties of tropical refined invariants

نویسندگان

چکیده

Tropical refined invariants of toric surfaces constitute a fascinating interpolation between real and complex enumerative geometries via tropical geometry. They were originally introduced by Block Göttsche, further extended Göttsche Schroeter in the case rational curves. In this paper, we study polynomial behavior coefficients these invariants. We prove that small codegree are polynomials Newton polygon curves under enumeration, when one fixes genus latter. This provides surprising reappearance, dual setting, so-called node conjecture. Our methods, based on floor diagrams Mikhalkin first author, entirely combinatorial. Although combinatorial treatment needed here is different, follow overall strategy designed Fomin developed Ardila Block. Hence our results may suggest phenomena geometry have not been studied yet. particular curves, extend polynomiality including extra parameter \(s\) recording number \(\psi\) classes. Contrary to with respect \( \Delta\), be expected from considerations Welschinger pleads favor geometric definition Göttsche-Schroeter invariants.Mathematics Subject Classifications: Primary 14T15, 14T90, 05A15; Secondary 14N10, 52B20Keywords: invariants, geometry, Gromov-Witten

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refined Seiberg-witten Invariants

In the past two decades, gauge theoretic methods became indispensable when considering manifolds in dimension four. Initially, research centred around the moduli spaces of Yang-Mills instantons. Simon Donaldson had introduced the instanton equations into the field. Using cohomological data of the corresponding moduli spaces, he defined invariants which could effectively distinguish differentiab...

متن کامل

Boosting k-Induction with Continuously-Refined Invariants

k-induction is a promising technique to extend bounded model checking from falsification to verification. In software verification, k-induction works only if auxiliary invariants are used to strengthen the induction hypothesis. The problem that we address is to generate such invariants (1) automatically without user-interaction, (2) efficiently such that little verification time is spent on the...

متن کامل

Combining k-Induction with Continuously-Refined Invariants

Bounded model checking (BMC) is a well-known and successful technique for finding bugs in software. k-induction is an approach to extend BMC-based approaches from falsification to verification. Automatically generated auxiliary invariants can be used to strengthen the induction hypothesis. We improve this approach and further increase effectiveness and efficiency in the following way: we start ...

متن کامل

Refined translation and scale Legendre moment invariants

Orthogonal Legendre moments are used in several pattern recognition and image processing applications. Translation and scale Legendre moment invariants were expressed as a combination of the approximate original Legendre moments. The shifted and scaled Legendre polynomials were expressed in terms of the original Legendre polynomials according to complicated and time-consuming algebraic relation...

متن کامل

Tropical Enumerative Invariants of F

There is an equation relating numbers of curves on F0 = P × P satisfying incidence conditions and numbers of curves on F2 satisfying incidence conditions. The purpose of this paper is to give a tropical proof of this equation (for some cases). We use two tropical methods. The first method proves the formula for rational curves. We use induction on the degree and two Kontsevich-type formulas for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorial theory

سال: 2022

ISSN: ['2766-1334']

DOI: https://doi.org/10.5070/c62257845